Syntactic Congruences and Syntactic Algebras
نویسنده
چکیده
منابع مشابه
Standard topological algebras: syntactic and principal congruences and profiniteness
A topological quasi-variety Q T ∼ ) := IScP + ∼ generated by a finite algebra ∼ with the discrete topology is said to be standard if it admits a canonical axiomatic description. Drawing on the formal language notion of syntactic congruences, we prove that Q T ∼ ) is standard provided that the algebraic quasi-variety generated by ∼ is a variety, and that syntactic congruences in that variety are...
متن کاملOn varieties of semigroups and unary algebras∗†
The elementary result of Variety theory is Eilenberg’s Variety theorem which was motivated by characterizations of several families of string languages by syntactic monoids or semigroups, such as Schützenberger’s theorem connecting star-free languages and aperiodic monoids. Eilenberg’s theorem has been extended in various directions. For example, Thérien involved varieties of congruences on fre...
متن کاملGeneral Varieties of Tree Languages
We consider varieties of tree languages which are not restricted to a fixed ranked alphabet, varieties of finite algebras that contain algebras of all finite types, and a matching notion of varieties of congruences. A variety theorem that yields isomorphisms between the lattices formed by these three types of varieties is proved. To achieve this, some basic universal algebra is suitably general...
متن کاملVarieties of Unranked Tree Languages
We study varieties that contain unranked tree languages over all alphabets. Trees are labeled with symbols from two alphabets, an unranked operator alphabet and an alphabet used for leaves only. Syntactic algebras of unranked tree languages are defined similarly as for ranked tree languages, and an unranked tree language is shown to be recognizable iff its syntactic algebra is regular, i.e., a ...
متن کاملPrincipal and Syntactic Congruences in Congruence-distributive and Congruence-permutable Varieties
We give a new proof that a finitely generated congruence-distributive variety has finitely determined syntactic congruences (or equivalently, term finite principal congruences), and show that the same does not hold for finitely generated congruence-permutable varieties, even under the additional assumption that the variety is residually very finite. 2000 Mathematics subject classification: 08B10.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- ITA
دوره 17 شماره
صفحات -
تاریخ انتشار 1983